Analytic Combinatorics of Chord Diagrams Analytic Combinatorics of Chord Diagrams Combinatoire Analytique Des Diagrammes De Cordes Analytic Combinatorics of Chord Diagrams
نویسندگان
چکیده
In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings. Key-words: Analytic combinatorics, chord diagram, asymptotic enumeration, limit distribution
منابع مشابه
ANALYTIC COMBINATORICS OF CHORD AND HYPERCHORD DIAGRAMS WITH k CROSSINGS
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function of the configurations with exactly k crossings as a rational function of the generating function of crossing-free configurations. Using these expressions, we...
متن کاملAnalytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration
The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics and the natural sciences. In addition to the now classical univariate theory, recent work in the study of analytic combinatorics in several variables (ACSV) h...
متن کاملChord diagrams, topological quantum field theory, and the sutured Floer homology of solid tori
I will talk about recent investigations of contact elements in the sutured Floer homology of solid tori, as part of the (1 + 1)-dimensional TQFT defined by Honda-Kazez-Matic. The Z2 sutured Floer homology vector spaces in this case form a ”categorification of Pascal’s triangle”, a triangle of vector spaces, with contact elements corresponding to chord diagrams and forming distinguished subsets ...
متن کاملChord diagram invariants of tangles and graphs
The notion of a chord diagram emerged from Vassiliev's work Vas90], Vas92] (see also Gusarov Gus91], Gus94] and Bar-Natan BN91], BN95]). Slightly later, Kontsevich Kon93] deened an invariant of classical knots taking values in the algebra generated by formal linear combinations of chord diagrams modulo the four-term relation. This knot invariant establishes an isomorphism of a projective limit ...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کامل